HW#4 --- last modified February 07 2019 04:20:55..

Solution set.

Due date: Nov 17

Files to be submitted:
  Hw4.zip

Purpose: To gain experience with first-order reasoning and planning algorithms.

Related Course Outcomes:

The main course outcomes covered by this assignment are:

LO2 -- By code or by hand translate sentences in first-order logic to conjunctive normal form (CNF).

LO3 -- By code or by hand find proofs by using resolution.

LO9 -- Students should be able to explain the advantages and disadvantages of the STRIPS representation for planning.

LO10 -- Students should be able to describe the frame problem.

LO11 -- Students should be able to describe default reasoning.

Specification:

Do the following problems out of the book 9.10, 9.23. For problem 9.10 (1/2pt) write the riddle down in a prenex normal form with a CNF formula inside the quantifiers. You don't need to use this formulation though as part of solving the problem unless you want to. Next do the following additional problems:

1. Draw the planning graph for the problem in Figure 10.3 in the book. Solve the problem step-by-step using the GraphPlan algorithm.
2. Briefly explain how PDDL solves the frame problem. Give some disadvantages to formulating problems in PDDL.
3. Extend the default rules for the Nixon-Diamond presented in the book on p.460 by rules so that rather than having two extensions, the resulting system has three. Give what those three extensions are and show carefully they are in fact extensions.

Point Breakdown